Serveur d'exploration sur l'OCR

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Efficient multiscale Sauvola's binarization

Identifieur interne : 000129 ( Main/Exploration ); précédent : 000128; suivant : 000130

Efficient multiscale Sauvola's binarization

Auteurs : Guillaume Lazzara [France] ; Thierry Geraud [France]

Source :

RBID : Pascal:14-0199548

Descripteurs français

English descriptors

Abstract

This work focuses on the most commonly used binarization method: Sauvola's. It performs relatively well on classical documents, however, three main defects remain: the window parameter of Sauvola's formula does not fit automatically to the contents, it is not robust to low contrasts, and it is not invariant with respect to contrast inversion. Thus, on documents such as magazines, the contents may not be retrieved correctly, which is crucial for indexing purpose. In this paper, we describe how to implement an efficient multiscale implementation of Sauvola's algorithm in order to guarantee good binarization for both small and large objects inside a single document without adjusting manually the window size to the contents. We also describe how to implement it in an efficient way, step by step. This algorithm remains notably fast compared to the original one. For fixed parameters, text recognition rates and binarization quality are equal or better than other methods on text with low and medium x-height and are significantly improved on text with large x-height. Pixel-based accuracy and OCR evaluations are performed on more than 120 documents. Compared to awarded methods in the latest binarization contests, Sauvola's formula does not give the best results on historical documents. On the other hand, on clean magazines, it outperforms those methods. This implementation improves the robustness of Sauvola's algorithm by making the results almost insensible to the window size whatever the object sizes. Its properties make it usable in full document analysis toolchains.


Affiliations:


Links toward previous steps (curation, corpus...)


Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" level="a">Efficient multiscale Sauvola's binarization</title>
<author>
<name sortKey="Lazzara, Guillaume" sort="Lazzara, Guillaume" uniqKey="Lazzara G" first="Guillaume" last="Lazzara">Guillaume Lazzara</name>
<affiliation wicri:level="3">
<inist:fA14 i1="01">
<s1>EPITA Research and Development Laboratory, LRDE, 14-16, rue Voltaire</s1>
<s2>94276 Le Kremlin-Bicêtre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName>
<region type="region" nuts="2">Île-de-France</region>
<settlement type="city">Le Kremlin-Bicêtre</settlement>
</placeName>
</affiliation>
</author>
<author>
<name sortKey="Geraud, Thierry" sort="Geraud, Thierry" uniqKey="Geraud T" first="Thierry" last="Geraud">Thierry Geraud</name>
<affiliation wicri:level="3">
<inist:fA14 i1="01">
<s1>EPITA Research and Development Laboratory, LRDE, 14-16, rue Voltaire</s1>
<s2>94276 Le Kremlin-Bicêtre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName>
<region type="region" nuts="2">Île-de-France</region>
<settlement type="city">Le Kremlin-Bicêtre</settlement>
</placeName>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">INIST</idno>
<idno type="inist">14-0199548</idno>
<date when="2014">2014</date>
<idno type="stanalyst">PASCAL 14-0199548 INIST</idno>
<idno type="RBID">Pascal:14-0199548</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000010</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000755</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000012</idno>
<idno type="wicri:doubleKey">1433-2833:2014:Lazzara G:efficient:multiscale:sauvola</idno>
<idno type="wicri:Area/Main/Merge">000130</idno>
<idno type="wicri:Area/Main/Curation">000129</idno>
<idno type="wicri:Area/Main/Exploration">000129</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a">Efficient multiscale Sauvola's binarization</title>
<author>
<name sortKey="Lazzara, Guillaume" sort="Lazzara, Guillaume" uniqKey="Lazzara G" first="Guillaume" last="Lazzara">Guillaume Lazzara</name>
<affiliation wicri:level="3">
<inist:fA14 i1="01">
<s1>EPITA Research and Development Laboratory, LRDE, 14-16, rue Voltaire</s1>
<s2>94276 Le Kremlin-Bicêtre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName>
<region type="region" nuts="2">Île-de-France</region>
<settlement type="city">Le Kremlin-Bicêtre</settlement>
</placeName>
</affiliation>
</author>
<author>
<name sortKey="Geraud, Thierry" sort="Geraud, Thierry" uniqKey="Geraud T" first="Thierry" last="Geraud">Thierry Geraud</name>
<affiliation wicri:level="3">
<inist:fA14 i1="01">
<s1>EPITA Research and Development Laboratory, LRDE, 14-16, rue Voltaire</s1>
<s2>94276 Le Kremlin-Bicêtre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName>
<region type="region" nuts="2">Île-de-France</region>
<settlement type="city">Le Kremlin-Bicêtre</settlement>
</placeName>
</affiliation>
</author>
</analytic>
<series>
<title level="j" type="main">International journal on document analysis and recognition : (Print)</title>
<title level="j" type="abbreviated">Int. j. doc. anal. recognit. : (Print)</title>
<idno type="ISSN">1433-2833</idno>
<imprint>
<date when="2014">2014</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<title level="j" type="main">International journal on document analysis and recognition : (Print)</title>
<title level="j" type="abbreviated">Int. j. doc. anal. recognit. : (Print)</title>
<idno type="ISSN">1433-2833</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Character recognition</term>
<term>Computer vision</term>
<term>Defect</term>
<term>Digitizing</term>
<term>Document analysis</term>
<term>Fast algorithm</term>
<term>Image analysis</term>
<term>Image processing</term>
<term>Indexing</term>
<term>Invariant</term>
<term>Inversion</term>
<term>Multiscale method</term>
<term>Old document</term>
<term>Optical character recognition</term>
<term>Pattern recognition</term>
<term>Robustness</term>
<term>Step by step method</term>
<term>Text</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr">
<term>Numérisation</term>
<term>Indexation</term>
<term>Reconnaissance caractère</term>
<term>Texte</term>
<term>Reconnaissance forme</term>
<term>Reconnaissance optique caractère</term>
<term>Analyse documentaire</term>
<term>Analyse image</term>
<term>Traitement image</term>
<term>Vision ordinateur</term>
<term>Défaut</term>
<term>Inversion</term>
<term>Document ancien</term>
<term>Méthode échelle multiple</term>
<term>Invariant</term>
<term>Méthode pas à pas</term>
<term>Algorithme rapide</term>
<term>Robustesse</term>
<term>.</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr">
<term>Numérisation</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">This work focuses on the most commonly used binarization method: Sauvola's. It performs relatively well on classical documents, however, three main defects remain: the window parameter of Sauvola's formula does not fit automatically to the contents, it is not robust to low contrasts, and it is not invariant with respect to contrast inversion. Thus, on documents such as magazines, the contents may not be retrieved correctly, which is crucial for indexing purpose. In this paper, we describe how to implement an efficient multiscale implementation of Sauvola's algorithm in order to guarantee good binarization for both small and large objects inside a single document without adjusting manually the window size to the contents. We also describe how to implement it in an efficient way, step by step. This algorithm remains notably fast compared to the original one. For fixed parameters, text recognition rates and binarization quality are equal or better than other methods on text with low and medium x-height and are significantly improved on text with large x-height. Pixel-based accuracy and OCR evaluations are performed on more than 120 documents. Compared to awarded methods in the latest binarization contests, Sauvola's formula does not give the best results on historical documents. On the other hand, on clean magazines, it outperforms those methods. This implementation improves the robustness of Sauvola's algorithm by making the results almost insensible to the window size whatever the object sizes. Its properties make it usable in full document analysis toolchains.</div>
</front>
</TEI>
<affiliations>
<list>
<country>
<li>France</li>
</country>
<region>
<li>Île-de-France</li>
</region>
<settlement>
<li>Le Kremlin-Bicêtre</li>
</settlement>
</list>
<tree>
<country name="France">
<region name="Île-de-France">
<name sortKey="Lazzara, Guillaume" sort="Lazzara, Guillaume" uniqKey="Lazzara G" first="Guillaume" last="Lazzara">Guillaume Lazzara</name>
</region>
<name sortKey="Geraud, Thierry" sort="Geraud, Thierry" uniqKey="Geraud T" first="Thierry" last="Geraud">Thierry Geraud</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000129 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000129 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Ticri/CIDE
   |area=    OcrV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     Pascal:14-0199548
   |texte=   Efficient multiscale Sauvola's binarization
}}

Wicri

This area was generated with Dilib version V0.6.32.
Data generation: Sat Nov 11 16:53:45 2017. Site generation: Mon Mar 11 23:15:16 2024